基于NTRUSign的代理签名方案

NTRUSign是一种基于NTRU的签名算法。该文使用最小向量困难问题构造了一种新型的基于NTRUSign的代理签名方案,并对该方案的各项基本安全性质进行了具体分析。结果表明该方案具有一个代理签名协议应有的一些基本性质,且拥有速度快操作简单的优点。     

表面水质遥感监测研究

主要讨论了应用多种传感器遥感技术进行表面水质监测研究的有效性。首先论述了纯水和不 同水质的波谱特性,然后以芬兰海湾和芬兰南部湖泊为应用实例,进行多种遥感数据和主要水质参 数之间的相关性分析,从而确定不同波谱段是否可以有效地监测表面水质的变化情况。本研究为新 一代传感器的设计提供水质监测的重要参数,进一步的试验研究仍在进行之中。     

基于断裂面匹配的破碎物体拼接技术

该文研究了曲面三角网格模型顶点法矢、主曲率和主方向的计算方法,分析了曲面上点的类型,提出了一种基于断裂面匹配的破碎物体拼接方法。分别用曲面上点的有向脚标和无向脚标构成有向特征向量和无向特征向量,在无向特征向量匹配的基础上,经过匹配点方向映射方法判断其它无向特征匹配点对的有向特征向量的相似性,完成断裂面匹配计算。在断裂面匹配的基础上,通过匹配点方向映射实现破碎物体的拼接。实验结果表明该算法可靠地实现了破碎物体的拼接。     

Jcluster: an efficient Java parallel environment on a large‐scale heterogeneous cluster

In this paper, we present Jcluster, an efficient Java parallel environment that provides some critical services, in particular automatic load balancing and high‐performance communication, for developing parallel applications in Java on a large‐scale heterogeneous cluster. In the Jcluster environment, we implement a task scheduler based on a transitive random stealing (TRS) algorithm. Performance evaluations show that the scheduler based on TRS can make any idle node obtain a task from another node with much fewer stealing times than random stealing (RS), which is a well‐known dynamic load‐balancing algorithm, on a large‐scale cluster. In the performance aspects of communication, with the method of asynchronously multithreaded transmission, we implement a high‐performance PVM‐like and MPI‐like message‐passing interface in pure Java. The evaluation of the communication performance is conducted among the Jcluster environment, LAM‐MPI and mpiJava on LAM‐MPI based on the Java Grande Forum's pingpong benchmark. Copyright © 2005 John Wiley & Sons, Ltd.     

群的置换表示与群的图表示

考虑群Ｇ在一个集合Ω上传递转换作用和把Ω做成Ｇ的Ｃ［Ω］模空间,得到Ｇ作为线性群在Ｃ［Ω］作用,那么二者有怎样的内在联系呢？本文主要结果是：群Ｇ在一个基数为ｐ的集合Ω上的作用是传递的,那么这个置换特征标π有如下分解式：⑴若Ｇ在Ω上的作用是二传递的,则π＝１Ｇ＋χｉ,ｄｅｇχ＝ｐ－１;⑵若Ｇ在Ω上的作用是单本原的,则π＝１Ｇ＋∑ｒｉ＝１χｉ,ｄｅｇχｉ＝ｍ,ｉ＝１,２,…,ｒ,ｐ－１＝ｍ·ｒ．此处数ｒ称为Ｇ的秩．     

Parathyroid Tumors: Molecular Signatures

Parathyroid tumors are rare endocrine neoplasms affecting 0.1–0.3% of the general population, including benign parathyroid adenomas (PAs; about 98% of cases), intermediate atypical parathyroid adenomas (aPAs; 1.2–1.3% of cases) and malignant metastatic parathyroid carcinomas (PCs; less than 1% of cases). These tumors are characterized by a variable spectrum of clinical phenotypes and an elevated cellular, histological and molecular heterogeneity that make it difficult to pre-operatively distinguish PAs, aPAs and PCs. Thorough knowledge of genetic, epigenetic, and molecular signatures, which characterize different parathyroid tumor subtypes and drive different tumorigeneses, is a key step to identify potential diagnostic biomarkers able to distinguish among different parathyroid neoplastic types, as well as provide novel therapeutic targets and strategies for these rare neoplasms, which are still a clinical and therapeutic challenge. Here, we review the current knowledge on gene mutations and epigenetic changes that have been associated with the development of different clinical types of parathyroid tumors, both in familial and sporadic forms of these endocrine neoplasms.     

Integration of Mutational Signature Analysis with 3D Chromatin Data Unveils Differential AID-Related Mutagenesis in Indolent Lymphomas

Activation-induced deaminase (AID) is required for somatic hypermutation in immunoglobulin genes, but also induces off-target mutations. Follicular lymphoma (FL) and chronic lymphocytic leukemia (CLL), the most frequent types of indolent B-cell tumors, are exposed to AID activity during lymphomagenesis. We designed a workflow integrating de novo mutational signatures extraction and fitting of COSMIC (Catalogue Of Somatic Mutations In Cancer) signatures, with tridimensional chromatin conformation data (Hi-C). We applied the workflow to exome sequencing data from lymphoma samples. In 33 FL and 30 CLL samples, 42% and 34% of the contextual mutations could be traced to a known AID motif. We demonstrate that both CLL and FL share mutational processes dominated by spontaneous deamination, failures in DNA repair, and AID activity. The processes had equiproportional distribution across active and nonactive chromatin compartments in CLL. In contrast, canonical AID activity and failures in DNA repair pathways in FL were significantly higher within the active chromatin compartment. Analysis of DNA repair genes revealed a higher prevalence of base excision repair gene mutations (p = 0.02) in FL than CLL. These data indicate that AID activity drives the genetic landscapes of FL and CLL. However, the final result of AID-induced mutagenesis differs between these lymphomas depending on chromatin compartmentalization and mutations in DNA repair pathways.     

The cryptanalysis of a public-key implementation of finite group mappings

Minghua Qu and Vanstone [2] have proposed a public-key cryptosystem (FGM) which is based on factorizations of a binary vector space (i.e., transversal logarithmic signatures of an elementary abelian 2-group). In this paper a generalized (basis-independent) decryption algorithm is given, which shows that there are many equivalent private keys, and a method of efficiently obtaining such an equivalent private key is given. The FGM cryptosystem is thus rendered insecure. Although the FGM cryptosystem is defined in terms of linear algebra, the attack given here is essentially group-theoretic in nature. Thus this attack throws doubt on any cryptosystem which relies on the security of transversal logarithmic signatures.This author was supported by S.E.R.C. Research Grant GR/H23719.     

Parallel processing of graph reachability in databases

In this paper we consider parallel processing of a graph represented by a database relation, and we achieved two objectives. First, we propose a methodology for analyzing the speedup of a parallel processing strategy with the purpose of selecting at runtime one of several candidate strategies, depending on the hardware architecture and the input graph. Second, we study the single-source reachability problem, namely the problem of computing the set of nodes reachable from a given node in a directed graph. We propose several parallel strategies for solving this problem, and we analyze their performance using our new methodology. The analysis is confirmed experimentally in a UNIX-Ethernet environment. We also extend the results to the transitive closure problem.A preliminary shortened version of this paper has appeared inPDIS. See Ref. 1.This author's work was supported in part by NSF Grant 90-03341.This author's work was supported in part by the Natural Sciences and Engineering Research Council of Canada.This author's work was supported in part by NSF Grant 90-03341.     

Algebraic optimization of recursive queries

Over the past few years, much attention has been paid to deductive databases. They offer a logic-based interface, and allow formulation of complex recursive queries. However, they do not offer appropriate update facilities, and do not support existing applications. To overcome these problems an SQL-like interface is required besides a logic-based interface.

In the PRISMA project we have developed a tightly-coupled distributed database, on a multiprocessor machine, with two user interfaces: SQL and PRISMAlog. Query optimization is localized in one component: the relational query optimizer. Therefore, we have defined an eXtended Relational Algebra that allows recursive query formulation and can also be used for expressing executable schedules, and we have developed algebraic optimization strategies for recursive queries. In this paper we describe an optimization strategy that rewrites regular (in the context of formal grammars) mutually recursive queries into standard Relational Algebra and transitive closure operations. We also describe how to push selections into the resulting transitive closure operations.

The reason we focus on algebraic optimization is that, in our opinion, the new generation of advanced database systems will be built starting from existing state-of-the-art relational technology, instead of building a completely new class of systems.